On the Number of Facets of Polytopes Representing Comparative Probability Orders

Fine and Gill (1973) introduced the geometric representation for those comparative probability orders on n atoms that have an underlying probability measure. In this representation every such comparative probability order is represented by a region of a certain hyperplane arrangement. Maclagan (1999) asked how many facets a polytope, which is the closure of such a region, might have. We prove that the maximal number of facets is at least F_{n+1}, where F_n is the nth Fibonacci number. We conjecture that this lower bound is sharp. Our proof is combinatorial and makes use of the concept of flippable pairs introduced by Maclagan. We also obtain an upper bound which is not too far from the lower bound.Comment: 13 page

Root-theoretic Young diagrams and Schubert Calculus

A longstanding problem in algebraic combinatorics is to find nonnegative combinatorial rules for the Schubert calculus of generalized flag varieties; that is, for the structure constants of their cohomology rings with respect to the Schubert basis. There are several natural choices of combinatorial indexing sets for the Schubert basis classes. This thesis examines a number of Schubert calculus problems from the common lens of root-theoretic Young diagrams (RYDs). In terms of RYDs, we present nonnegative Schubert calculus rules for the (co)adjoint varieties of classical Lie type. Using these we give polytopal descriptions of the set of nonzero Schubert structure constants for the (co)adjoint varieties where the RYDs are all planar, and suggest a connection between planarity of the RYDs and polytopality of the nonzero Schubert structure constants. This is joint work with A. Yong. For the family of (nonmaximal) isotropic Grassmannians, we characterize the RYDs and give a bijection between RYDs and the k-strict partitions of A. Buch, A. Kresch and H. Tamvakis. We apply this bijection to show that the (co)adjoint Schubert calculus rules agree with the Pieri rules of A. Buch, A. Kresch and H. Tamvakis, which is needed for the proofs of the (co)adjoint rules. We also use RYDs to study the Belkale-Kumar deformation of the ordinary cup product on cohomology of generalized flag varieties. This product structure was introduced by P. Belkale and S. Kumar and used to study a generalization of the Horn problem. A structure constant of the Belkale-Kumar product is either zero or equal to the corresponding Schubert structure constant, hence the Belkale-Kumar product captures a certain subset of the Schubert structure constants. We give a new formula (after that of A. Knutson and K. Purbhoo) in terms of RYDs for the Belkale-Kumar product on flag varieties of type A. We also extend this formula outside of type A to the (co)adjoint varieties of classical type. With O. Pechenik, we introduce a new deformed product structure on the cohomology of generalized flag varieties, whose nonzero structure constants can be understood in terms of projections to smaller flag varieties. We draw comparisons with the ordinary cup product and the Belkale-Kumar product

Large expert-curated database for benchmarking document similarity detection in biomedical literature search

Document recommendation systems for locating relevant literature have mostly relied on methods developed a decade ago. This is largely due to the lack of a large offline gold-standard benchmark of relevant documents that cover a variety of research fields such that newly developed literature search techniques can be compared, improved and translated into practice. To overcome this bottleneck, we have established the RElevant LIterature SearcH consortium consisting of more than 1500 scientists from 84 countries, who have collectively annotated the relevance of over 180 000 PubMed-listed articles with regard to their respective seed (input) article/s. The majority of annotations were contributed by highly experienced, original authors of the seed articles. The collected data cover 76% of all unique PubMed Medical Subject Headings descriptors. No systematic biases were observed across different experience levels, research fields or time spent on annotations. More importantly, annotations of the same document pairs contributed by different scientists were highly concordant. We further show that the three representative baseline methods used to generate recommended articles for evaluation (Okapi Best Matching 25, Term Frequency-Inverse Document Frequency and PubMed Related Articles) had similar overall performances. Additionally, we found that these methods each tend to produce distinct collections of recommended articles, suggesting that a hybrid method may be required to completely capture all relevant articles. The established database server located at https://relishdb.ict.griffith.edu.au is freely available for the downloading of annotation data and the blind testing of new methods. We expect that this benchmark will be useful for stimulating the development of new powerful techniques for title and title/abstract-based search engines for relevant articles in biomedical research.Peer reviewe